Unary predicates.
نویسندگان
چکیده
منابع مشابه
Quantum Algorithms for Finding Extrema with Unary Predicates
We study the problem of finding the maximum or the minimum of a given set S = {x0, x1, . . . xn−1}, each element xi drawn from some finite universe U of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the form ”Is xi greater than, equal to, or less than some constant k?” Classically, this problem is solved...
متن کاملThe Church problem for expansions of (N, <) by unary predicates
For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X,F(X)) is universally valid over Nat. Büchi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended versio...
متن کاملPresburger Arithmetic with Unary Predicates Is 1 1 Complete
We give a simple proof characterizing the complexity of Pres-burger arithmetic augmented with additional predicates. We show that Pres-burger arithmetic with additional predicates is 1 1 complete. Adding one unary predicate is enough to get 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse.
متن کاملRandom unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1). For each k, we give an axiomatization for the theory Tk. We find a model Mk of Tk of order type roughly that of Z and show that no other models of Tk exist of smaller size.
متن کاملThe Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the known boundary between decidable and undecidable in that we show that the purely universal fragment of the extended theory is already undecidable. Our proof is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1974
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891497